The Weak Extension Property and Finite Axiomatizability for Quasivarieties
نویسندگان
چکیده
We define and compare a selection of congruence properties of quasivarieties, including the relative congruence meet semi-distributivity, RSD(∧), and the weak extension property, WEP. We prove that if K ⊆ L ⊆ L′ are quasivarieties of finite signature, and L′ is finitely generated while K |= WEP, then K is finitely axiomatizable relative to L. We prove for any quasivariety K that K |= RSD(∧) iff K has pseudo-complemented congruence lattices and K |= WEP. Applying these results and other results proved in M. Maróti, R. McKenzie [17] we prove that a finitely generated quasivariety of finite signature L is finitely axiomatizable provided that L satisfies RSD(∧), or that L is relatively congruence modular and is included in a residually small congruence modular variety. This yields as a corollary the full version of R. Willard’s theorem for quasivarieties and partially proves a conjecture of D. Pigozzi. Finally, we provide a quasi-Maltsev type characterization for RSD(∧) quasivarieties and supply an algorithm for recognizing when the quasivariety generated by a finite set of finite algebras satisfies RSD(∧).
منابع مشابه
Weak alg-universality and Q-universality of semigroup quasivarieties
In an earlier paper, the authors showed that standard semigroups M1, M2 andM3 play an important role in the classification of weaker versions of alg-universality of semigroup varieties. This paper shows that quasivarieties generated by M2 and M3 are neither relatively alg-universal nor Q-universal, while there do exist finite semigroups S2 and S3 generating the same semigroup variety as M2 and ...
متن کاملOn the U-WPF Acts over Monoids
Valdis Laan in [5] introduced an extension of strong flatness which is called weak pullback flatness. In this paper we introduce a new property of acts over monoids, called U-WPF which is an extension of weak pullback flatness and give a classification of monoids by this property of their acts and also a classification of monoids when this property of acts implies others. We also show that regu...
متن کاملOn Finite Bases for Weak Semantics: Failures Versus Impossible Futures
We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.
متن کاملThe Equational Theory of Weak Complete Simulation Semantics over BCCSP
This paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional groundcomplete axiomatizations for the weak complete simulation precongruence. In sharp contrast to this positive result, we prove that, in the presence of at least one observable action, the (in)equ...
متن کاملSimulating polyadic modal logics by monadic ones
We define an interpretation of modal languages with polyadic operators in modal languages that use monadic operators (diamonds) only. We also define a simulation operator which associates a logic Λ in the diamond language with each logic Λ in the language with polyadic modal connectives. We prove that this simulation operator transfers several useful properties of modal logics, such as finite/r...
متن کامل